On primitive covering numbers
نویسندگان
چکیده
منابع مشابه
Primitive normal matrices and covering numbers of nite groups
A primitive matrix is a square matrix M with nonnegative real entries such that the entries of M are all positive for some positive integer s. The smallest such s is called the primitivity index of M . Primitive matrices of normal type (namely: MM and MM have the same zero entries) occur naturally in studying the so called conjugacy-class covering numberand character covering numberof a ni...
متن کاملOn Covering Numbers
A positive integer n is called a covering number if there are some distinct divisors n1, . . . , nk of n greater than one and some integers a1, . . . , ak such that Z is the union of the residue classes a1(mod n1), . . . , ak(mod nk). A covering number is said to be primitive if none of its proper divisors is a covering number. In this paper we give some sufficient conditions for n to be a (pri...
متن کاملCovering Numbers in Covering-Based Rough Sets
Rough set theory provides a systematic way for rule extraction, attribute reduction and knowledge classification in information systems. Some measurements are important in rough sets. For example, information entropy, knowledge dependency are useful in attribute reduction algorithms. This paper proposes the concepts of the lower and upper covering numbers to establish measurements in covering-b...
متن کاملOn Asymmetric Coverings and Covering Numbers
An asymmetric covering D(n,R) is a collection of special subsets S of an n-set such that every subset T of the n-set is contained in at least one special S with |S| − |T | ≤ R. In this paper we compute the smallest size of any D(n, 1) for n ≤ 8. We also investigate “continuous” and “banded” versions of the problem. The latter involves the classical covering numbers C(n, k, k−1), and we determin...
متن کاملNew Covering Array Numbers
A covering array CA(N ; t, k, v) is anN×k array on v symbols such that everyN×t subarray contains as a row each t-tuple over the v symbols at least once. The minimum N for which a CA(N ; t, k, v) exists is called the covering array number of t, k, and v, and it is denoted by CAN(t, k, v). In this work we prove that if exists CA(N ; t+ 1, k + 1, v) it can be obtained from the juxtaposition of v ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Number Theory
سال: 2016
ISSN: 1793-0421,1793-7310
DOI: 10.1142/s1793042117500038